SRRT* - a probabilistic optimal trajectory planner for problematic area structures
نویسندگان
چکیده
منابع مشابه
Towards an efficient optimal trajectory planner for multiple mobile robots
In this paper, we present a real-time algorithm that plans mostly optimal trajectories for multiple mobile robots in a dynamic environment. This approach combines the use of a Delaunay triangulation to discretise the environment, a novel efficient use of the A* search method, and a novel cubic spline representation for a robot trajectory that meets the kinematic and dynamic constraints of the r...
متن کاملAn Optimal Trajectory Planner for a Robotic Batting Task: The Table Tennis Example
This paper presents an optimal trajectory planner for a robotic batting task . The specific case of a table tennis game performed by a robot is considered. Given an estimation of the trajectory of the ball during the free flight, the method addresses the determination of the paddle configuration (pose and velocity) to return the ball at a desired position with a desired spin. The implemented al...
متن کاملProttle: A Probabilistic Temporal Planner
Planning with concurrent durative actions and probabilistic effects, or probabilistic temporal planning, is a relatively new area of research. The challenge is to replicate the success of modern temporal and probabilistic planners with domains that exhibit an interaction between time and uncertainty. We present a general framework for probabilistic temporal planning in which effects, the time a...
متن کاملEngineering a Conformant Probabilistic Planner
We present a partial-order, conformant, probabilistic planner, Probapop which competed in the blind track of the Probabilistic Planning Competition in IPC-4. We explain how we adapt distance based heuristics for use with probabilistic domains. Probapop also incorporates heuristics based on probability of success. We explain the successes and difficulties encountered during the design and implem...
متن کاملCOMPLAN: A Conformant Probabilistic Planner∗
COMPLAN is a conformant probabilistic planner that finds a plan with maximum probability of success for a given horizon. The core of the planner is a a depth-first branch-andbound search in the plan space. For each potential search node, an upper bound is computed on the success probability of the best plans under the node, and the node is pruned if this upper bound is not greater than the succ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.11.157